Related family-based attribute reduction of covering information systems when varying attribute sets
نویسنده
چکیده
In practical situations, there are many dynamic covering information systems with variations of attributes, but there are few studies on related family-based attribute reduction of dynamic covering information systems. In this paper, we first investigate updated mechanisms of constructing attribute reducts for consistent and inconsistent covering information systems when varying attribute sets by using related families. Then we employ examples to illustrate how to compute attribute reducts of dynamic covering information systems with variations of attribute sets. Finally, the experimental results illustrates that the related familybased methods are effective to perform attribute reduction of dynamic covering information systems when attribute sets are varying with time.
منابع مشابه
Related families-based attribute reduction of dynamic covering information systems with variations of object sets
In practice, there are many dynamic covering decision information systems, and knowledge reduction of dynamic covering decision information systems is a significant challenge of covering-based rough sets. In this paper, we first study mechanisms of constructing attribute reducts for consistent covering decision information systems when adding objects using related families. We also employ examp...
متن کاملMULTI-ATTRIBUTE DECISION MAKING METHOD BASED ON BONFERRONI MEAN OPERATOR and possibility degree OF INTERVAL TYPE-2 TRAPEZOIDAL FUZZY SETS
This paper proposes a new approach based on Bonferroni mean operator and possibility degree to solve fuzzy multi-attribute decision making (FMADM) problems in which the attribute value takes the form of interval type-2 fuzzy numbers. We introduce the concepts of interval possibility mean value and present a new method for calculating the possibility degree of two interval trapezoidal type-2 fuz...
متن کاملKnowledge reduction of dynamic covering decision information systems with varying attribute values
Knowledge reduction of dynamic covering information systems involves with the time in practical situations. In this paper, we provide incremental approaches to computing the type-1 and type-2 characteristic matrices of dynamic coverings because of varying attribute values. Then we present incremental algorithms of constructing the second and sixth approximations of sets by using characteristic ...
متن کاملA Family of Covering Rough Sets Based Algorithm for Reduction of Attributes
180 Abstract— Attribute reduction of an information system is a key problem in rough set theory and its application. It has been proven that finding the minimal reduct of an information system is a NP-hard problem. Main reason of causing NP-hard is combination problem. In this paper, we theoretically study covering rough sets and propose an attribute reduction algorithm of decision systems. It ...
متن کاملA novel method for attribute reduction of covering decision systems
Attribute reduction has become an important step in pattern recognition and machine learning tasks. Covering rough sets, as a generalization of classical rough sets, have attracted wide attention in both theory and application. This paper provides a novel method for attribute reduction based on covering rough sets. We review the concepts of consistent and inconsistent covering decision systems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.07321 شماره
صفحات -
تاریخ انتشار 2017